- system completeness
- Макаров: полнота системы
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
Completeness of the real numbers — Intuitively, completeness implies that there are not any “gaps” (in Dedekind s terminology) or “missing points” in the real number line. This contrasts with the rational numbers, whose corresponding number line has a “gap” at each irrational… … Wikipedia
Completeness — In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields. Contents 1 Logical completeness 2 Mathematical completeness 3 Computing 4 … Wikipedia
Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… … Wikipedia
completeness — See completely. * * * Concept of the adequacy of a formal system that is employed both in proof theory and in model theory (see logic). In proof theory, a formal system is said to be syntactically complete if and only if every closed sentence in… … Universalium
completeness — Intuitively, a logical system is complete if everything that we want can be derived in it. Thus a formalization of logic is complete if all logically valid forms of argument are derivable in the system; a system designed to codify mathematical… … Philosophy dictionary
System integrity — In telecommunications, the term system integrity has the following meanings: # That condition of a system wherein its mandated operational and technical parameters are within the prescribed limits. # The quality of an AIS when it performs its… … Wikipedia
completeness — noun 1. the state of being complete and entire; having everything that is needed (Freq. 2) • Ant: ↑incompleteness • Derivationally related forms: ↑complete • Hypernyms: ↑integrity, ↑unity, ↑ … Useful english dictionary
Completeness (knowledge bases) — A knowledge base KB is complete if there is no formular α such that KB ⊭ α and KB ⊭ ¬α. Example of knowledge base with incomplete knowledge: KB := { A ∨ B } Then we have KB ⊭ A and KB ⊭ ¬A. In some cases, you can make a consistent knowledge… … Wikipedia
Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… … Wikipedia
Turing completeness — For the usage of this term in the theory of relative computability by oracle machines, see Turing reduction. In computability theory, a system of data manipulation rules (such as an instruction set, a programming language, or a cellular… … Wikipedia
Tag system — A tag system is a deterministic computational model published by Emil Leon Post in 1943 as a simple form of Post canonical system. A tag system may also be viewed as an abstract machine, called a Post tag machine (not to be confused with Post… … Wikipedia